Tableau Recycling
نویسنده
چکیده
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walker. The algorithm proves whether a property expressed in the modal mu-calculus holds for a state in a finite transition system. It makes subsequent use of subtableaux which were calculated earlier in the proof run. These aubtab|eaux are reduced to expressions. Examples show that both size of tableaux and execution time of the algorithm are reduced.
منابع مشابه
Combinatorics of Tableau Inversions
A tableau inversion is a pair of entries in row-standard tableau T that lie in the same column of T yet lack the appropriate relative ordering to make T columnstandard. An i-inverted Young tableau is a row-standard tableau along with precisely i inversion pairs. Tableau inversions were originally introduced by Fresse to calculate the Betti numbers of Springer fibers in Type A, with the number o...
متن کاملMatrix Tableau-pairs with Key and Shuffling Conditions
It has been shown that the sequence of Smith invariants defined by certain sequences of products of matrices, with entries in a local principal ideal domain, are combinatorially described by tableau-pairs (T, K) where T is a tableau of skew-shape which rectifies to the key-tableau K. It is a fact that the set of all shuffles of the columns of a key-tableau is a subset of its Knuth class. Here, ...
متن کاملTerminating tableau calculi for modal logic K with global counting operators
This paper presents the first systematic treatment of tableau calculi for modal logic K with global counting operators. Using a recently introduced tableau synthesis framework we establish two terminating tableau calculi for the logic. Whereas the first calculus is a prefix tableau calculus, the second is a refinement that internalises the semantics of the logic without using nominals. We prove...
متن کاملSynthesising and Implementing Tableau Calculi for Interrogative Epistemic Logics
This paper presents a labelled tableau approach for deciding interrogative-epistemic logics (IEL). Tableau calculi for these logics have been derived using a recently introduced tableau synthesis method. We also consider an extension of the framework for a setting with questioning modalities over sequences of formulae called sequential questioning logic (SQL). We have implemented the calculi us...
متن کاملA Fibred Tableau Calculus for BDI Logics
In [12,16] we showed how to combine propositional BDI logics using Gabbay’s fibring methodology. In this paper we extend the above mentioned works by providing a tableau-based decision procedure for the combined/fibred logics. To achieve this end we first outline with an example two types of tableau systems, (graph & path), and discuss why both are inadequate in the case of fibring. Having done...
متن کامل